Leaf languages and string compression ∗ Markus
نویسنده
چکیده
Tight connections between leafs languages and strings compressed via straight-line programs (SLPs) are established. It is shown that the compressed membership problem for a language L is complete for the leaf language class defined by L via logspace machines. A more difficult variant of the compressed membership problem for L is shown to be complete for the leaf language class defined by L via polynomial timemachines. As a corollary, a fixed linear visibly pushdown language with a PSPACE-complete compressed membership problem is obtained. For XML languages, the compressed membership problem is shown to be coNP-complete.
منابع مشابه
Leaf languages and string compression
Tight connections between leaf languages and strings compressed by straightline programs (SLPs) are established. It is shown that the compressed membership problem for a language L is complete for the leaf language class defined by L via logspace machines. A more difficult variant of the compressed membership problem for L is shown to be complete for the leaf language class defined by L via pol...
متن کاملLogspace and Logtime Leaf Languages
The computation tree of a nondeterministic machine M with input x gives rise to a leaf string formed by concatenating the outcomes of all the computations in the tree in lexicographical order. We may characterize problems by considering, for a particular \leaf language" Y , the set of all x for which the leaf string of M is contained in Y . In this way, in the context of polynomial time computa...
متن کاملOn the Power of Polynomial Bit-Reductions
We examine the notion of deenability of complexity classes via leaf languages, introduced a nondeterministic polynomial time Turing machine M and an input string x, the leaf string of M on x is the sequence of output values over all paths (0 for a rejecting, 1 for an accepting path) of the computation of M with input x. A class C is deenable via leaf language B, if for every A 2 C, there exists...
متن کاملQuerying and Embedding Compressed Texts
The computational complexity of two simple string problems on compressed input strings is considered: the querying problem (What is the symbol at a given position in a given input string?) and the embedding problem (Can the first input string be embedded into the second input string?). Straight-line programs are used for text compression. It is shown that the querying problem becomes P-complete...
متن کاملAlgorithmics on SLP-compressed strings: A survey
Results on algorithmic problems on strings that are given in a compressed form via straightline programs are surveyed. A straight-line program is a context-free grammar that generates exactly one string. In this way, exponential compression rates can be achieved. Among others, we study pattern matching for compressed strings, membership problems for compressed strings in various kinds of formal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008